package com.leetcode.algorithm.y22.m06;

/**
 * 136. 只出现一次的数字
 * 
 * https://leetcode.cn/problems/single-number/
 * 
 * @author jie.deng
 *
 */
class Question0136Solution01 {
	
	public int singleNumber(int[] nums) {
		int x = 0;
		for (int i = 0; i < nums.length; i++) {
			x = (x ^ nums[i]);
		}
		return x;
	}
    
}